\paragraph{}
\begin{verbatim}
Example 1:
----------
Graph G {connected, directed};
Vertex V1, V2, V3, V4;
Edge E1 (w = 3); /* An edge with a weight */
Edge E2 (w = 1);
Edge E3 (w = 4);
AddVertex(G, V1); /* Adding Vertices to the graph */
AddVertex(G, V2);
AddVertex(G, V3);
AddVertex(G, v4);
ConnectEdge(G, V1, V2, E1); /* Connect Vertices with Edges */
ConnectEdge(G, V3, V4, E2);
ConnectEdge(G, V2, V4, E3);
TP_DFS mydfs;
ConnectGraph(mydfs, G);
TP_run(mydfs);
TP_Tree mytree;
GetTree(mydfs, mytree);
Print(mytree);

Example 2:
----------
TP_tree mytree {red_black};
Node N1, N2, N3, N4;
TP_NodeValue V1, V2, V3, V4; /* Node values: This give 
the ability to have several types for values */
V1.val = 2;
V2.val = 3; V3.val = 4; V4.val = 5;
AssignNodeValue(N1, V1); /* Assigne value to node */
AssignNodeValue(N2, V2); 
AssignNodeValue(N3, V3);
AssignNodeValue(N4, V4);
AddNode(mytree, V1, "root");
AddNode(mytree, V2);
AddNode(mytree, V3);
AddNode(mytree, V4);
TP_BFS mybfs;
/* Everything done using connections */
Connection conn = ConnectTree(mybfs, mytree);
conn.execute();
Traverstal mytrav = conn.getTraversal();
mytrav.Print();

Example 3: (Inspired by SDL)
----------------------------
Tree mytree {
  rootNode {
    value = 3;
  }

  SubTree {			     
    rootNode {			      
      value = 5;
    }
    SubTree {
	rootNode {
	  value = 8;
	}
	Leaf L {
	  // Attributes
	  value = 1;
	  height = "long";
	}
	Leaf L1 {
	  value = 0;
	}
    }
  }

  Leaf K {
    value = 9;
  }
}

TreeNodeList mylist;

BinarySearch mysearch{
      Tree = mytree;
      value = 5;
}

Find(mysearch, mylist);

\end{verbatim}
